#include <iostream>
#include <string>
#include <unordered_set>
#include <vector>

using namespace std;

// Q1. 分割字符串
// https://leetcode.cn/contest/weekly-contest-456/problems/partition-string/description/

class Solution {
public:
    vector<string> partitionString(string s) {
        vector<string> ans;
        unordered_set<string> res;
        string curStr;
        for (int i = 0; i < s.size(); i++)
        {
            curStr += s[i];
            if(res.find(curStr) == res.end()){
                res.insert(curStr);
                ans.push_back(curStr);
                curStr.clear();
            }
        }
        return ans;
    }
};

int main()
{
    return 0;
}